Locally connected graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamiltonian N2-locally connected claw-free graphs

A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjác̆ek conjectured that every 3-connected N2-locally connected claw-free graph is hamiltonian. This conjecture is proved in this note.

متن کامل

Locally connected spanning trees on graphs

A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ∈ V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.

متن کامل

Lower Bounds for Locally Highly Connected Graphs

We propose a conjecture regarding the lower bound for the number of edges in locally k-connected graphs and we prove it for k = 2. In particular, we show that every connected locally 2-connected graph is M3-rigid. For the special case of surface triangulations, this fact was known before using topological methods. We generalize this result to all locally 2-connected graphs and give a purely com...

متن کامل

On (s, t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t , a graph G is (s, t)-supereulerian if for any disjoint sets X, Y ⊂ E(G) with |X | ≤ s and |Y | ≤ t , there is a spanning eulerian subgraph H of G that contains X and avoids Y . We prove that if G is connected and locally k-edge-connected, thenG is (s, t)-supereulerian, for any pair of nonnegative integers s and t with s+t ≤ k−1. We further show that if s ...

متن کامل

Contractible Edges in 2-Connected Locally Finite Graphs

In this paper, we prove that every contraction-critical 2-connected infinite graph has no vertex of finite degree and contains uncountably many ends. Then, by investigating the distribution of contractible edges in a 2-connected locally finite infinite graph G, we show that the closure of the subgraph induced by all the contractible edges in the Freudenthal compactification of G is 2-arc-connec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Časopis pro pěstování matematiky

سال: 1974

ISSN: 0528-2195

DOI: 10.21136/cpm.1974.117838